Collision detection of convex polyhedra on the NVIDIA GPU architecture for the discrete element method

نویسندگان

  • Nicolin Govender
  • Daniel N. Wilke
  • Schalk Kok
چکیده

Convex polyhedra represent granular media well. This geometric representation may be critical in obtaining realistic simulations of many industrial processes using the discrete element method (DEM). However detecting collisions between the polyhedra and surfaces that make up the environment and the polyhedra themselves is computationally expensive. This paper demonstrates the significant computational benefits that the graphical processor unit (GPU) offers DEM. As we show, this requires careful consideration due to the architectural differences between CPU and GPU platforms. This paper describes the DEM algorithms and heuristics that are optimized for the parallel NVIDIA Kepler GPU architecture in detail. This includes a GPU optimized collision detection algorithm for convex polyhedra based on the separating plane (SP) method. In addition, we present heuristics optimized for the parallel NVIDIA Kepler GPU architecture. Our algorithms have minimalistic memory requirements, which enables us to store data in the limited but high bandwidth constant memory on the GPU. We systematically verify the DEM implementation, where after we demonstrate the computational scaling on two large-scale simulations. We are able achieve a new performance level in DEM by simulating 34 million polyhedra on a single NVIDIA K6000 GPU. We show that by using the GPU with algorithms tailored for the architecture, large scale industrial simulations are possible on a single graphics card.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approach to Improve Particle Swarm Optimization Algorithm Using CUDA

The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...

متن کامل

Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra

In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of al...

متن کامل

Development of a convex polyhedral discrete element simulation framework for NVIDIA Kepler based GPUs

Understanding the dynamical behavior of Granular Media (GM) is extremely important to many industrial processes. Thus simulating the dynamics of GM is critical in the design and optimization of such processes. However, the dynamics of GM is complex in nature and cannot be described by a closed form solution for more than a few particles. A popular and successful approach in simulating the under...

متن کامل

Collision Detection of Convex Polyhedra Based on Duality Transformation

Collision detection is an essential problem in many applications in computer graphics, CAD/CAM, and robotics. In this paper, a new method, called CD-Dual, for detecting collision between two convex polyhedra is proposed. The idea is based on a local search among the faces on the Minkowski difference (M) of the polyhedra. The local search is guided by a simple signed distance function defined on...

متن کامل

A Novel Collision Detection Method Based on Enclosed Ellipsoid

The paper introduced an efficient collision detection method for convex polyhedra in a three -dimensional workspace. In cooperation with the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding ellipsoids for object representation, and more efficient than the polyhedral methods. An approach for compu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 267  شماره 

صفحات  -

تاریخ انتشار 2015